The Growth Ratio of Synchronous Rational Relations Is Unique
نویسنده
چکیده
We introduce α-synchronous relations for a rational number α. We show that if a rational relation is both αand α-synchronous for two different numbers α and α, then it is recognizable. We give a synchronization algorithm for α-synchronous transducers. We also prove the closure under boolean operations and composition of α-synchronous relations.
منابع مشابه
Inner Permanent Magnet Synchronous Machine Optimization for HEV Traction Drive Application in Order to Achieve Maximum Torque per Ampere
Recently, Inner permanent magnet (IPM) synchronous machines have been introduced as a possible traction motor in hybrid electric vehicle (HEV) and traction applications due to their unique merits. In order to achieve maximum torque per ampere (MTPA), optimization of the motor geometry parameters is necessary. This paper Presents a design method to achieve minimum volume, MTPA and minimum ...
متن کاملSynchronous Regular Relations and Morphological Analysis
We list the major properties of some important classes of subrational relations, mostly to make them easily accessible to computational linguists. We then argue that there are good linguistic reasons for using no class smaller than the class of synchronous regular relations for morphological analysis, and good mathematical reasons for using no class which is larger. 1 Below the Rational Relatio...
متن کاملDecision problems among the main subfamilies of rational relations
We consider the four families of recognizable, synchronous, deterministic rational and rational subsets of a direct product of free monoids. They form a strict hierarchy and we investigate the following decision problem: given a relation in one of the family, does it belong to a smaller family? We settle the problem entirely when all monoids have a unique generator and fill some gaps in the gen...
متن کاملMulti-tape Computing with Synchronous Relations
We sketch an approach to encode relations of arbitrary arity as simple languages. Our main focus will be faithfulness of the encoding: we prove that with normal finite-state methods, it is impossible to properly encode the full class of rational (i.e. transducer recognizable) relations; however, there is a simple encoding for the synchronous rational relations. We present this encoding and show...
متن کاملSynchronous Subsequentiality and Approximations to Undecidable Problems
We introduce the class of synchronous subsequential relations, a subclass of the synchronous relations which embodies some properties of subsequential relations. If we take relations of this class as forming the possible transitions of an infinite automaton, then most decision problems (apart from membership) still remain undecidable (as they are for synchronous and subsequential rational relat...
متن کامل